Symbolic Computation of Minimal Probabilistic Reachability∗
نویسندگان
چکیده
This paper continues our study of the verification problem for infinitestate systems featuring both nondeterministic and probabilistic choice. In an earlier paper we defined symbolic probabilistic systems, an extension of the framework of symbolic transition systems due to Henzinger et. al., and considered the problem of deciding the maximal probability of reaching a set of target states. A symbolic probabilistic system is an infinite-state system equipped with an algebra of symbolic operators on its state space, additionally extended with a symbolic encoding of probabilistic transitions to obtain a model for infinite-state probabilistic systems. In this paper we generalise the notion of symbolic probabilistic systems and consider the minimal reachability problem, that is, the problem of computing the minimal probability of reaching a given set of target states. An exact answer to this problem is obtained algorithmically via iteration of a refined version of the classical predecessor operation, combined with intersection and set difference operations. As in the previous work on symbolic transition systems, our state space exploration algorithm is semi-decidable for infinite-state systems. Together with the earlier work concerning the maximal reachability problem, the results presented here yield a semi-decidable algorithm for model checking symbolic systems against the probabilistic temporal logic PCTL. We illustrate our approach with the help of probabilistic timed automata, for which previous verification techniques suffered from an unnecessarily fine subdivisions of the state space, or which returned only estimates of the actual probabilities.
منابع مشابه
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of the maximal probability of reaching a given set of states, and underlies decision procedures for the automatic verification of probabilistic systems. We extend the framework of symbolic transition systems, which equips...
متن کاملConstraint-Based Analysis of Concurrent Probabilistic Hybrid Systems: An Application to Networked Automation Systems
In previous publications, the authors have introduced the notion of stochastic satisfiability modulo theories (SSMT) and the corresponding SiSAT solving algorithm, which provide a symbolic method for the reachability analysis of probabilistic hybrid systems. SSMT extends satisfiability modulo theories (SMT) with randomized (or stochastic), existential, and universal quantification, as known fro...
متن کاملSubsumer-First: Steering Symbolic Reachability Analysis
Symbolic reachability analysis provides a basis for the verification of software systems by offering algorithmic support for the exploration of the program state space when searching for proofs or counterexamples. The choice of exploration strategy employed by the analysis has direct impact on its success, whereas the ability to find short counterexamples quickly and—as a complementary task—to ...
متن کاملComputing Information Flow Using Symbolic Model-Checking
Several measures have been proposed in literature for quantifying the information leaked by the public outputs of a program with secret inputs. We consider the problem of computing information leaked by a deterministic or probabilistic program when the measure of information is based on (a) min-entropy and (b) Shannon entropy. The key challenge in computing these measures is that we need the to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003